The Fault-Tolerant Cluster-Sending Problem

The Fault-Tolerant Early Bird Problem

The capabilities of reliable computations in one-dimensional cellular automata are investigated by means of the Early Bird Problem. The problem is typical for situations in massively parallel systems where a global behavior must be achieved by only local interactions between the single elements. The cells that cause the misoperations are assumed to behave as follows. They run a self-diagnosis b...

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel fPhys. Rev. Lett. 86, 5188 s2001dg shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computa...

Cluster Fault-tolerant Routing in Pancake Graphs

In this paper, we propose an O(n) algorithm that finds a fault-free path between any pair of non-faulty nodes in an n-pancake graph with n−2 faulty clusters whose diameters are at most 2. The lengths of the paths obtained by our algorithm are at most d◦(Pn)+7 where d◦(Pn) = b5(n+1)/3c represents the upper bound of the diameter of Pn given by Gates and Papadimitriou. According to the computer ex...

Fault - Tolerant Cluster of Networking Elements

The Design and Implementation of a Fault-Tolerant Cluster Manager

Cluster management middleware schedules tasks on a cluster, controls access to shared resources, provides for task submission and monitoring, and coordinates the cluster’s fault tolerance mechanisms. Thus, reliable continuous operation of the management middleware is a prerequisite to the reliable operation of the cluster. Hence, the management middleware should tolerate a wide class of faults ...